SUFFICIENCY IN NONSMOOTH MULTIOBJECTIVE FRACTIONAL PROGRAMMING

Nonsmooth Multiobjective Fractional Programming with Generalized Invexity

In this paper, we consider nonsmooth multiobjective fractional programming problems involving locally Lipschitz functions. We introduce the property of generalized invexity for fractional function. We present necessary optimality conditions, sufficient optimality conditions and duality relations for nonsmooth multiobjective fractional programming problems, which is for a weakly efficient soluti...

Sufficiency and duality in multiobjective fractional programming problems involving generalized type I functions

*Correspondence: [email protected] Chung-Jen Junior College of Nursing, Health Sciences and Management, Dalin, 62241, Taiwan Abstract In this paper, we establish sufficient optimality conditions for the (weak) efficiency to multiobjective fractional programming problems involving generalized (F,α,ρ ,d)-V-type I functions. Using the optimality conditions, we also investigate a parametric-type dua...

Mixed Duality for Nonsmooth Multiobjective Fractional Programming without a Constraint Qualification

Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints

We consider nonsmooth multiobjective fractional programming problems with inequality and equality constraints. We establish the necessary and sufficient optimality conditions under various generalized invexity assumptions. In addition, we formulate a mixed dual problem corresponding to primal problem, and discuss weak, strong and strict converse duality theorems.

Sufficiency in multiobjective subset programming involving generalized type-I functions

In this paper, sufficient optimality conditions for a multiobjective subset programming problem are established under generalized (F ,α, ρ,d)-type-I functions.